ON QUANTIFIER FLOATING

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Floating Quantifiers and Lexical Specification of Quantifier Retrieval

Floating quantifiers (FQs) in English exhibit both universal and language-specific properties, and this paper shows that such syntactic and semantic characteristics can be explained in terms of a constraint-based, lexical approach to the construction within the framework of Head-Driven Phrase Structure Grammar (HPSG). Based on the assumption that FQs are base-generated VP modifiers, this paper ...

متن کامل

On Quantifier Domain Restriction

In this paper, we provide a comprehensive survey of the space of possible analyses of the phenomenon of quantifier domain restriction, together with a set of considerations which militate against all but our own proposal. Among the many accounts we consider and reject are the ‘explicit’ approach to quantifier domain restriction discussed, for example, by Stephen Neale, and the pragmatic approac...

متن کامل

Polymorphic Quantifier

The generalized quantifier theory does not apply to Japanese quantifiers since: i) the number of NP argument is unspecified; and, ii) quantities are often expressed by predicative adjectives. The word order changes the interpretation, e.g., non-split quantifiers correspond to definite NPs with uniqueness and maximality conditions while split NPs are wide scope indefinites. This paper shows that...

متن کامل

Quantifier Elimination

Quantifier elimination (QE) is a very powerful procedure for problems involving first­order formulas over real fields. The cylindrical algebraic decomposition (CAD) is a technique for the “efficient” im­ plementation of QE, that effectively reduces an seemingly infinite problem into a finite (but potentially large) instance. For much more information about QE and CAD (including a reprint of Tar...

متن کامل

On FO2 Quantifier Alternation over Words

We show that each level of the quantifier alternation hierarchy within FO[<] on words is a variety of languages. We use the notion of condensed rankers, a refinement of the rankers defined by Weis and Immerman, to produce a decidable hierarchy of varieties which is interwoven with the quantifier alternation hierarchy – and conjecturally equal to it. It follows that the latter hierarchy is decid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ENGLISH LINGUISTICS

سال: 1994

ISSN: 0918-3701,1884-3107

DOI: 10.9793/elsj1984.11.100